Effect of congestion costs on shortest paths through complex networksASHTON, Douglas J; JARRETT, Timothy C; JOHNSON, Neil F et al.Physical review letters. 2005, Vol 94, Num 5, pp 058701.1-058701.4, issn 0031-9007Article

Enhancing traffic capacity for scale-free networks by the one-way linksKE HU; CHAOFEI LIU; TAO HU et al.Journal of physics. A, Mathematical and theoretical (Print). 2010, Vol 43, Num 17, issn 1751-8113, 175101.1-175101.10Article

Vertex labeling and routing in expanded Apollonian networksZHONGZHI ZHANG; COMELLAS, Francesc; FERTIN, Guillaume et al.Journal of physics. A, Mathematical and theoretical (Print). 2008, Vol 41, Num 3, issn 1751-8113, 035004.1-035004.10Article

Position space renormalisation group study of shortest paths in percolation clustersRAY, P.Journal of physics. A, mathematical and general. 1985, Vol 18, Num 11, pp L657-L660, issn 0305-4470Article

An O(n³ (log log n/log n )^5/4) time algorithm for all pairs shortest pathsYIJIE HAN.Lecture notes in computer science. 2006, pp 411-417, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 7 p.Conference Paper

An O(n³(loglogn/log n)^5/4) Time Algorithm for All Pairs Shortest PathYIJIE HAN.Algorithmica. 2008, Vol 51, Num 4, pp 428-434, issn 0178-4617, 7 p.Article

On geometric structure of global roundings for graphs and range spacesASANO, Tetsuo; KATOH, Naoki; TAMAKI, Hisao et al.Lecture notes in computer science. 2004, pp 455-467, issn 0302-9743, isbn 3-540-22339-8, 13 p.Conference Paper

Developing a Scheduler with Difference-Bound Matrices and the Floyd-Warshall Algorithm : ALGORITHMS FOR TODAY'S PRACTIOTIONERRIDI, Lorenzo; TORRINI, Jacopo; VICARIO, Enrico et al.IEEE software. 2012, Vol 29, Num 1, pp 76-83, issn 0740-7459, 8 p.Article

Using selective path-doubling for parallel shortest-path computationsCOHEN, E.Journal of algorithms (Print). 1997, Vol 22, Num 1, pp 30-56, issn 0196-6774Article

The SPCP on two relaxed special-type networksLI, M. Z; FUSHIMI, M.Zeitschrift für angewandte Mathematik und Mechanik. 1996, Vol 76, pp 595-596, issn 0044-2267, SUP2Conference Paper

A note on the expected path length of trees with known fringeDE PRISCO, R; PARLATI, G; PERSIANO, G et al.Information processing letters. 1996, Vol 59, Num 6, pp 309-315, issn 0020-0190Article

Finding real-valued single-source shortest paths in o(n³) expected timeKOLLIOPOULOS, S. G; STEIN, C.Journal of algorithms (Print). 1998, Vol 28, Num 1, pp 125-141, issn 0196-6774Article

Finding the detour-critical-edge of a shortest path between two nodesNARDELLI, E; PROIETTI, G; WIDMAYER, P et al.Information processing letters. 1998, Vol 67, Num 1, pp 51-54, issn 0020-0190Article

Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulationsGOODRICH, M. T; TAMASSIA, R.Journal of algorithms (Print). 1997, Vol 23, Num 1, pp 51-73, issn 0196-6774Article

An efficient algorithm for shortest paths in vertical and horizontal segmentsEPPSTEIN, D; HART, D. W.Lecture notes in computer science. 1997, pp 234-247, issn 0302-9743, isbn 3-540-63307-3Conference Paper

On geometric path query problemsCHEN, D. Z; DAESCU, O; KLENK, K. S et al.Lecture notes in computer science. 1997, pp 248-257, issn 0302-9743, isbn 3-540-63307-3Conference Paper

Finding feasible pathways in metabolic networksPITKÄNEN, Esa; RANTANEN, Ari; ROUSU, Juho et al.Lecture notes in computer science. 2005, pp 123-133, issn 0302-9743, isbn 3-540-29673-5, 1Vol, 11 p.Conference Paper

Three algorithms for a minimum cost file transfer problemKANEKO, Yoshihiro.MWSCAS : Midwest symposium on circuits and systems. 2004, isbn 0-7803-8346-X, 3Vol, Vol II, 493-496Conference Paper

The approach-dependent, time-dependent, label-constrained shortest path problemSHERALI, Hanif D; JEENANUNTA, Chawalit; HOBEIKA, Antoine G et al.Networks (New York, NY). 2006, Vol 48, Num 2, pp 57-67, issn 0028-3045, 11 p.Article

Computing the threshold for q-gram filtersKÄRKKÄINEN, Juha.Lecture notes in computer science. 2002, pp 348-357, issn 0302-9743, isbn 3-540-43866-1, 10 p.Conference Paper

Using the density of paths for semantic relatedness measurementKHOUNSIAVASH, A. Ehsan; BARAANI-DASTJERDI, B. Ahmad.Semantic web & web services. International conferenceWorldComp'2010. 2010, pp 18-24, isbn 1-60132-161-9, 7 p.Conference Paper

An O (n log n) Algorithm for Maximum st-Flow in a Directed Planar GraphBORRADAILE, Glencora; KLEIN, Philip.Journal of the Association for Computing Machinery. 2009, Vol 56, Num 2, issn 0004-5411, 9.1-9.30Article

Finding non-dominated bicriteria shortest pairs of disjoint simple pathsCLIMACO, Joao C. N; PASCOAL, Marta M. B.Computers & operations research. 2009, Vol 36, Num 11, pp 2892-2898, issn 0305-0548, 7 p.Article

On the hardness of embeddings between two finite metricsCARY, Matthew; RUDRA, Atri; SABHARWAL, Ashish et al.Lecture notes in computer science. 2005, pp 1412-1423, issn 0302-9743, isbn 3-540-27580-0, 12 p.Conference Paper

All-pairs shortest paths with real weights in O(n³/logn) timeCHAN, Timothy M.Lecture notes in computer science. 2005, pp 318-324, issn 0302-9743, isbn 3-540-28101-0, 7 p.Conference Paper